Search Results

Documents authored by Statman, Richard


Document
The Completeness of BCD for an Operational Semantics

Authors: Richard Statman

Published in: LIPIcs, Volume 97, 22nd International Conference on Types for Proofs and Programs (TYPES 2016)


Abstract
We give a completeness theorem for the BCD theory of intersection types in an operational semantics based on logical relations.

Cite as

Richard Statman. The Completeness of BCD for an Operational Semantics. In 22nd International Conference on Types for Proofs and Programs (TYPES 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 97, pp. 15:1-15:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)


Copy BibTex To Clipboard

@InProceedings{statman:LIPIcs.TYPES.2016.15,
  author =	{Statman, Richard},
  title =	{{The Completeness of BCD for an Operational Semantics}},
  booktitle =	{22nd International Conference on Types for Proofs and Programs (TYPES 2016)},
  pages =	{15:1--15:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-065-1},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{97},
  editor =	{Ghilezan, Silvia and Geuvers, Herman and Ivetic, Jelena},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2016.15},
  URN =		{urn:nbn:de:0030-drops-98478},
  doi =		{10.4230/LIPIcs.TYPES.2016.15},
  annote =	{Keywords: intersection types, operational semantics, Beth model, logical relations, forcing}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail